Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
نویسندگان
چکیده
منابع مشابه
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number
Let r(= r(n))!1 with 3 r n1 for an arbitrarily small constant > 0, and let Gr denote a graph chosen uniformly at random from the set of r-regular graphs with vertex set f1; 2; : : : ; ng. We prove that with probability tending to 1 as n!1, Gr has the following properties: the independence number of Gr is asymptotically 2n log r r and the chromatic number of Gr is asymptotically r 2 log r .
متن کاملRandom regular graphs of non-constant degree: Concentration of the chromatic number
In this work we show that with high probability the chromatic number of a graph sampled from the random regular graph model Gn,d for d = o(n ) is concentrated in two consecutive values, thus extending a previous result of Achlioptas and Moore. This concentration phenomena is very similar to that of the binomial random graph model G(n, p) with p = d n . Our proof is largely based on ideas of Alo...
متن کاملRandom Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity
Let Gr denote a graph chosen uniformly at random from the set of r-regular graphs with vertex set f1; 2; : : : ; ng where 3 r c0n for some small constant c0. We prove that with probability tending to 1 as n ! 1, Gr is r-connected and Hamiltonian.
متن کاملThe Chromatic Number of Random Regular Graphs
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1, or k + 2.
متن کاملOn random regular graphs with non-constant degree
We study random r-regular labelled graphs with n vertices. For r = 0(n ) we give the asymptotic number of them and show that they are almost all r-connected and hamiltonian. Proofs are based on the analysis of a simple algorithm for finding "almost" random regular graphs. (Diversity Libraries §
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2002
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548302005254